Transactions on Rough Sets XI

Transactions on Rough Sets XII


Rough Set and Knowledge Technology %2D 5th International Conference




Approximations and Classifiers.
. This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. This is important because in many text classification problems obtaining training labels is expensive, while large quantities of unlabeled documents are readily available. We introduce an algorithm for learning from labeled and unlabeled documents based on the combination of Expectation-Maximization (EM) and a naive Bayes classifier. The algorithm first trains a classifier using the available labeled documents, and probabilistically labels the unlabeled documents. It then trains a new classifier using the labels for all the documents, and iterates to convergence. This basic EM procedure works well when the data conform to the generative assumptions of the model. However these assumptions are often violated in practice, and poor performance can result. We present two extensions to the algorithm that improve ...
Information Systems in Modeling Interactive Computations on Granules.

Toward Interactive Computations A Rough%2DGranular Approach.

Approximation Spaces in Rough%2DGranular Computing.

Irreducible Descriptive Sets of Attributes for Information Systems.

Comparison of Some Classification Algorithms Based on Deterministic and Nondeterministic Decision Rules.

Inhibitory Rules in Data Analysis A Rough Set Approach

Transactions on Rough Sets X

Wisdom Technology A Rough%2DGranular Approach.

Interactive Rough%2DGranular Computing in Pattern Recognition.


Interactive Granular Computing in Rightly Judging Systems.


On Minimal Inhibitory Rules for Almost All k%2DValued Information Systems.

Rough Sets and Knowledge Technology
Abstract. A reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of a given information table. A general definition of an attribute reduct is presented. Specifically, we discuss the following issues: First, there are a variety of properties that can be observed in an information table. Second, the preservation of a certain property by an attribute set can be evaluated by different measures, defined as different fitness functions. Third, by considering the monotonicity property of a particular fitness function, the reduct construction method needs to be carefully examined. By adopting different heuristics or fitness functions for preserving a certain property, one is able to derive most of the existing definitions of a reduct. The analysis brings new insight into the problem of reduct construction, and provides guidelines for the design of new algorithms.
Transactions on Rough Sets VIII

Transactions on Rough Sets IX
Abstract. This paper introduces Debellor (www.debellor.org)  – an open source extensible data mining platform with stream-based architecture, where all data transfers between elementary algorithms take the form of a stream of samples. Data streaming enables implementation of scalable algorithms, which can efficiently process large volumes of data, exceeding available memory. This is very important for data mining research and applications, since the most challenging data mining tasks involve voluminous data, either produced by a data source or generated at some intermediate stage of a complex data processing network. Advantages of data streaming are illustrated by experiments with clustering time series. The experimental results show that even for moderatesize data sets streaming is indispensable for successful execution of algorithms, otherwise the algorithms run hundreds times slower or just crash due to memory shortage. Stream architecture is particularly useful in such application domains as time series analysis, image recognition or mining data streams. It is also the only efficient architecture for implementation of online algorithms. The algorithms currently available on Debellor platform include all classifiers from Rseslib and Weka libraries and all filters from Weka.
On Irreducible Descriptive Sets of Attributes for Information Systems.

Rough Set Approach to KDD %28Extended Abstract%29.

Comparison of Lazy Classification Algorithms Based on Deterministic and Inhibitory Decision Rules.

Rough Set Theory.

Case%2Dbased Planning of Treatment of Infants with Respiratory Failure.

Optimization in Discovery of Compound Granules.

Maximal consistent extensions of information systems relative to their theories.

Extracting Relevant Information about Reduct Sets from Data Tables.

Transactions on Rough Sets VI

Transactions on Rough Sets VII
Abstract. Definability and approximations are two important notions of the theory of rough sets. In many studies, one is used to define the other. There is a lack of an explicit interpretation of the physical meaning of definability. In this paper, the definability is used as a more primitive notion, interpreted in terms of formulas of a logic language. A set is definable if there is a formula that defines the set, i.e., the set consists of all those elements satisfying the formula. As a derived notion, the lower and upper approximations of a set are two definable sets that approximate the set from below and above, respectively. This formulation may be more natural, bringing new insights into our understanding of rough set approximations. 1
Rough Sets and Intelligent Systems Paradigms

Machine Learning ECML 2007

Knowledge Discovery in Databases PKDD 2007

Requiremnents Interaction an Conflicts A Rough Set Approach.

Discovery of Process Models from Data and Domain Knowledge A Rough%2DGranular Approach.

On Covering Attribute Sets by Reducts.

Modeling of High Quality Granules.

Toward Rough%2DGranular Computing.

Two Families of Classification Algorithms.

Approximation Space%2DBased Socio%2DTechnical Conflict Model.

Approximation Space%2DBased Socio%2DTechnical Conflict Model.

Rough Sets and Conflict Analysis.

In Memory of Professor Zdzislaw Pawlak.

Life and Work of Zdzislaw Pawlak.

Rough Set Approach to Behavioral Pattern Identification.

Approaches to Conflict Dynamics Based on Rough Sets.

Nearness of Objects Extension of Approximation Space Model.

On Minimal Rule Sets for Almost All Binary Information Systems.

Zdzislaw Pawlak life and work %281926%2D2006%29.

Rough sets Some extensions.

Rudiments of rough sets.
This paper introduces upper and lower approximations of concepts with respect to an  infinite concept class C and presents necessary and sufficient conditions for C to have such approximate concepts always in C. Then, we compare these notions with those of the rough set theory and show that the former can be regarded as an extension of the latter. Further, we propose a framework of learning upper and lower approximations of any concept with respect to an infinite concept class, and some efficient learning algorithms are presented. 1 Introduction  Inductive inference is a process of identifying a target concept from examples. Gold formulated this process as an infinite procedure of identifying a target concept in the limit, which is called Gold&#039;s identification in the limit [Gol67]. Including Gold&#039;s learning model, almost all of the frameworks of computational learning theory ([Ang80] [Ang88] [Val84], etc.) assume that a target concept is contained in a hypothesis space, which is not al...
Rough sets and Boolean reasoning.
s. The quantization of real value attributes is one of the main problem to be solved in synthesis of decision rules from data tables with real value attributes. We present an approach to this problem based on rough set methods and Boolean reasoning. The main result states that the problem of optimal quantization of real value attributes is polynomially reducible to the problem of minimal reduct finding, so it is NP-hard. We construct efficient heuristics for finding suboptimal quantization of real value attributes.  1 INTRODUCTION  A great effort has been made (see e.g. [5], [7], [9], [17], [18]) to find effective methods for real value attributes quantization (discretization). Our approach is based on the rough set methods and Boolean reasoning. We discuss the computational complexity of the quantization problems and we show that they can be solved by Boolean reasoning [1]. We prove that the main quantization problems are either NP -complete or NP - hard. We show that the problem of o...
A Wistech Paradigm for Intelligent Systems.

Rough Sets and Knowledge Technology
Abstract. A reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of a given information table. A general definition of an attribute reduct is presented. Specifically, we discuss the following issues: First, there are a variety of properties that can be observed in an information table. Second, the preservation of a certain property by an attribute set can be evaluated by different measures, defined as different fitness functions. Third, by considering the monotonicity property of a particular fitness function, the reduct construction method needs to be carefully examined. By adopting different heuristics or fitness functions for preserving a certain property, one is able to derive most of the existing definitions of a reduct. The analysis brings new insight into the problem of reduct construction, and provides guidelines for the design of new algorithms.
Transactions on Rough Sets V
Abstract. A basic notion shared by rough set analysis and formal concept analysis is the definability of a set of objects based on a set of properties. The two theories can be compared, combined and applied to each other based on definability. In this paper, the notion of rough set approximations is introduced into formal concept analysis. Rough set approximations are defined by using a system of definable sets. The similar idea can be used in formal concept analysis. The families of the sets of objects and the sets of properties established in formal concept analysis are viewed as two systems of definable sets. The approximation operators are then formulated with respect to the systems. Two types of approximation operators, with respect to lattice-theoretic and set-theoretic interpretations, are studied. The results provide a better understanding of data analysis using rough set analysis and formal concept analysis. 1
Approximate Reasoning in MAS Rough Set Approach.

Independent Component Analysis

Planning Based on Reasoning About Information Changes.

Generalized Conflict and Resolution Model with Approximation Spaces.

Automatic Planning of Treatment of Infants with Respiratory Failure Through Rough Set Modeling.

Zdzislaw Pawlak Commemorating His Life and Work.

On Testing Membership to Maximal Consistent Extensions of Information Systems.

Some Contributions by Zdzislaw Pawlak.

Toward Perception Based Computing A Rough%2DGranular Perspective.

Calculi of Approximation Spaces.

Zdzislaw Pawlak Life and Work.

Multimodal Classification Case Studies.

Rough Sets and Vague Concept Approximation From Sample Approximation to Adaptive Learning.

2005 IEEE International Conference on Granular Computing

Proceedings of the 2005 IEEE%2FWIC%2FACM International Conference on Intelligent Agent Technology
A team-based competitive environment is a complex multi-agent environment, in which agents are required to coordinate among each other not only to enhance their collective behavior, but also to compete with other teams. Based on the Minority Game (MG) model, we have provided a strategy for assisting a team to win in RoboCup and in a more general environment, i.e., DynaGrid. In this paper, we aim to examine the effectiveness of the MG-based strategy for Dyna-Grid in more complete situations, e.g., both regular and irregular situations. We also propose a method for measuring the irregular complexity of a dynamic environment. Thus we are able to quantitatively figure out the typical situations in which the MG strategy works. Through experimental validation, we have found: (1) the MG strategy can generally speaking help a team of agents to enhance their competitiveness in a dynamically-changing environment, e.g., the target object is in a nonlinear or irregular motion; (2) the MG strategy does not have an edge over a commonly-used greedy strategy under some specific circumstances where a learning window is not large enough.
2005 IEEE %2F WIC %2F ACM International Conference on Web Intelligence %28WI 2005%29

Proceedings of the 2005 IEEE%2FWIC%2FACM International Conference on Intelligent Agent Technology
A team-based competitive environment is a complex multi-agent environment, in which agents are required to coordinate among each other not only to enhance their collective behavior, but also to compete with other teams. Based on the Minority Game (MG) model, we have provided a strategy for assisting a team to win in RoboCup and in a more general environment, i.e., DynaGrid. In this paper, we aim to examine the effectiveness of the MG-based strategy for Dyna-Grid in more complete situations, e.g., both regular and irregular situations. We also propose a method for measuring the irregular complexity of a dynamic environment. Thus we are able to quantitatively figure out the typical situations in which the MG strategy works. Through experimental validation, we have found: (1) the MG strategy can generally speaking help a team of agents to enhance their competitiveness in a dynamically-changing environment, e.g., the target object is in a nonlinear or irregular motion; (2) the MG strategy does not have an edge over a commonly-used greedy strategy under some specific circumstances where a learning window is not large enough.
Transactions on Rough Sets III


Transactions on Rough Sets IV

Rough Sets in Perception%2DBased Computing.

On%2DLine Elimination of Non%2Drelevant Parts of Complex Objects in Behavioral Pattern Identification.
Abstract. We discuss some rough set tools for perception modelling that have been developed in our project for a system for modelling networks of classifiers for compound concepts. Such networks make it possible to recognize behavioral patterns of objects and their parts changing over time. We present a method that we call a method for on-line elimination of non-relevant parts (ENP). This method was developed for on-line elimination of complex object parts that are irrelevant for identifying a given behavioral pattern. Some results of experiments with data from the road simulator are included. 1

Rough Sets and Higher Order Vagueness.

Hierarchical Information Maps.
Wikipedia is an online encyclopedia which has undergone tremendous growth. However, this same growth has made it difficult to characterize its content and coverage. In this paper we develop measures to map Wikipedia using its socially annotated, hierarchical category structure. We introduce a mapping technique that takes advantage of socially-annotated hierarchical categories while dealing with the inconsistencies and noise inherent in the distributed way that they are generated. The technique is demonstrated through two applications: mapping the distribution of topics in Wikipedia and how they have changed over time; and mapping the degree of conflict found in each topic area. We also discuss the utility of the approach for other applications and datasets involving
Ontological Framework for Approximation.
Methods of symbolic computation in the presence of imprecision and uncertainty of information are important to many areas of computational mathematics. They are fundamentally important to the Semantic Web and generally important to other areas such as Artificial Intelligence. When fully realized, the Semantic Web will enable wide spread sharing and integration of machine stored information and software. Cornerstone of the Semantic Web is ontologies that describe domains of discourse and provide semantics to data. Ontologies identify important concepts in the domain and describe relationships between them. This is critical to achieving true machine understanding of Web’s resources. In the Semantic Web ontologies are often defined as formal logical structures that support intelligent machine processing. Current methodologies for representing ontologies do not provide sufficient support for managing imprecision. Defining ontologies is difficult for domains that contain imprecise knowledge, i.e. knowledge that cannot be represented by means of crisp logic and classical sets. Examples include uncertain, incomplete, vague and subjective knowledge. Computational methods such as reasoning with imprecise ontologies are not broadly provided. There is a critical need to have: first, a formal mathematical methodology for representing imprecise ontologies and second, formal methods for evaluating and computing with imprecise ontologies. Objective evidence for existence of this need is the extensive number of imprecise domains on
A Hierarchical Approach to Multimodal Classification.

Behavioral Pattern Identification Through Rough Set Modelling.

Rough Sets.
A rapid growth of interest in rough set theory [290] and its applications  can be lately seen in the number of international workshops, conferences and  seminars that are either directly dedicated to rough sets, include the subject  in their programs, or simply accept papers that use this approach to solve  problems at hand. A large number of high quality papers on various aspects  of rough sets and their applications have been published in recent years as a  result of this attention. The theory has been followed by the development of  several software systems that implement rough set operations. In Section 12 we  present a list of software systems based on rough sets. Some of the toolkits, provide  advanced graphical environments that support the process of developing  and validating rough set classifiers. Rough sets are applied in many domains,  such as, for instance, medicine, finance, telecommunication, vibration analysis,  conflict resolution, intelligent agents, image analysis, p...
Rough Sets and Vague Concepts.

Modelling Complex Patterns by Information Systems.

Spatio%2DTemporal Approximate Reasoning over Complex Objects.

Hierarchical modelling in searching for complex patterns constrained sums of information systems.

Approximation Spaces and Information Granulation.
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a universe. Both algebraic and probabilistic rough set approximations are studied. The probabilistic approximations are defined in a decision-theoretic framework. The problem of rule induction, a major application of rough set theory, is studied in probabilistic and information-theoretic terms. Two types of rules are analyzed, the local, low order rules, and the global, high order rules. 1
Transactions on Rough Sets I

Transactions on Rough Sets II

Approximation Spaces and Information Granulation.
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a universe. Both algebraic and probabilistic rough set approximations are studied. The probabilistic approximations are defined in a decision-theoretic framework. The problem of rule induction, a major application of rough set theory, is studied in probabilistic and information-theoretic terms. Two types of rules are analyzed, the local, low order rules, and the global, high order rules. 1
K Nearest Neighbor Classification with Local Induction of the Simple Value Difference Metric.
The classical k nearest neighbor (k-nn) classification assumes  that a fixed global metric is defined and searching for nearest neighbors  is always based on this global metric. In the paper we present a model  with local induction of a metric. Any test object induces a local metric  from the neighborhood of this object and selects k nearest neighbors  according to this locally induced metric. To induce both the global and  the local metric we use the weighted Simple Value Difference Metric  (SVDM). The experimental results show that the proposed classification  model with local induction of a metric reduces classification error up to  several times in comparison to the classical k-nn method.
Constrained Sums of Information Systems.

Rough Set Methods in Approximation of Hierarchical Concepts.

Reasoning in Information Maps.

Complex Patterns.
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketch and use only the sketch to decide whether a given pattern occurs in the text. We also prove a sketch size lower bound for approximate pattern matching, and show it is tight up to a logarithmic factor.
Hyperrelations in version space.
A version space is a set of all hypotheses consistent with a given set of training examples, delimited by the specific boundary and the general boundary. In existing studies [5, 6, 8] a hypothesis is a conjunction of attribute-value pairs, which is shown to have limited expressive power [9]. In a more expressive hypothesis space, e.g., disjunction of conjunction of attribute-value pairs, a general version space becomes uninteresting unless some restriction (inductive bias) is imposed [9]. In this paper we investigate version space in a hypothesis space where a hypothesis is a hyperrelation, which is in effect a disjunction of conjunctions of disjunctions of attribute-value pairs. Such a hypothesis space is more expressive than the conjunction of attribute-value pairs and the disjunction of conjunction of attribute-value pairs. However, given a dataset, we focus our attention only on those hypotheses which are consistent with given data and are maximal in the sense that the elements in a hypothesis can not be merged further. Such a hypothesis is called an E--set  for the given data, and the set of all E--sets is the version space which is delimited by the least E--set (specific boundary) and the greatest E--set (general boundary). Based on this version space we propose three classification rules for use in different situations. The first two are based on E--sets, and the third one is based on &#034;degraded&#034; E--sets called weak hypotheses, where the maximality constraint is relaxed. We present an algorithm to calculate E--sets, though it is computationally expensive in the worst case. We also present an efficient algorithm to calculate weak hypotheses. The third rule is evaluated using public datasets, and the results compare well with C5.0 decision tree classifier. 1 
Layered Learning for Concept Synthesis.

Independent Component Analysis

Rough Sets
A rapid growth of interest in rough set theory [290] and its applications  can be lately seen in the number of international workshops, conferences and  seminars that are either directly dedicated to rough sets, include the subject  in their programs, or simply accept papers that use this approach to solve  problems at hand. A large number of high quality papers on various aspects  of rough sets and their applications have been published in recent years as a  result of this attention. The theory has been followed by the development of  several software systems that implement rough set operations. In Section 12 we  present a list of software systems based on rough sets. Some of the toolkits, provide  advanced graphical environments that support the process of developing  and validating rough set classifiers. Rough sets are applied in many domains,  such as, for instance, medicine, finance, telecommunication, vibration analysis,  conflict resolution, intelligent agents, image analysis, p...
Rough Sets and Information Granulation.

Searching for the Complex Decision Reducts The Case Study of the Survival Analysis.
Generalization of the fundamental rough set discernibility  tools aiming at searching for relevant patterns for complex decisions is  discussed. As an example of application, there is considered the postsurgery  survival analysis problem for the head and neck cancer cases.
A View on Rough Set Concept Approximations.

Rough Set Approach to Domain Knowledge Approximation.

Reasoning Based on Information Changes in Information Maps.

Rough Sets Trends and Challenges.

Preface.
part of a series of studies in support of the California Governor’s Advisory Committee on Education Excellence. i PREFACE i LIST OF FIGURES iv
Rough Set Approach to Pattern Extraction from Classifiers.

Rough Sets and Infomorphisms Towards Approximation of Relations in Distributed Environments.

Preface.
part of a series of studies in support of the California Governor’s Advisory Committee on Education Excellence. i PREFACE i LIST OF FIGURES iv
Preface.
part of a series of studies in support of the California Governor’s Advisory Committee on Education Excellence. i PREFACE i LIST OF FIGURES iv
Rough set methods in feature selection and recognition.
We present applications of rough set methods for feature selection in pattern recognition. We emphasize the role of the basic constructs of rough set approach in feature selection, namely reducts and their approximations, including dynamic reducts. In the overview of methods for feature selection we discuss feature selection criteria, including the rough set based methods. Our algorithm for feature selection is based on an application of a rough set method to the result of principal components analysis (PCA) used for feature projection and reduction. Finally, the paper presents numerical results of face and mammogram recognition experiments using neural network, with feature selection based on proposed PCA and rough set methods.
A Rough Set Approach to Measuring Information Granules.

Measures of Inclusion and Closeness of Information Granules A Rough Set Approach.

Rough Neurocomputing Based on Hierarchical Classifiers.

Patterns in Information Maps.
As the world has grown more complex, the problems of communication in today&#039;s technical and business environments become increasingly demanding. Vast challenging technical products, service, and administrative and managerial subject matters, diverse multi-lingual, multinational organizations- all present new problems for managers, technical and office personnel and other professionals. Documents, on paper and presented on the computer screen, must
Rough Set Approach to the Survival Analysis.

Hyperrelations in version space.
A version space is a set of all hypotheses consistent with a given set of training examples, delimited by the specific boundary and the general boundary. In existing studies [5, 6, 8] a hypothesis is a conjunction of attribute-value pairs, which is shown to have limited expressive power [9]. In a more expressive hypothesis space, e.g., disjunction of conjunction of attribute-value pairs, a general version space becomes uninteresting unless some restriction (inductive bias) is imposed [9]. In this paper we investigate version space in a hypothesis space where a hypothesis is a hyperrelation, which is in effect a disjunction of conjunctions of disjunctions of attribute-value pairs. Such a hypothesis space is more expressive than the conjunction of attribute-value pairs and the disjunction of conjunction of attribute-value pairs. However, given a dataset, we focus our attention only on those hypotheses which are consistent with given data and are maximal in the sense that the elements in a hypothesis can not be merged further. Such a hypothesis is called an E--set  for the given data, and the set of all E--sets is the version space which is delimited by the least E--set (specific boundary) and the greatest E--set (general boundary). Based on this version space we propose three classification rules for use in different situations. The first two are based on E--sets, and the third one is based on &#034;degraded&#034; E--sets called weak hypotheses, where the maximality constraint is relaxed. We present an algorithm to calculate E--sets, though it is computationally expensive in the worst case. We also present an efficient algorithm to calculate weak hypotheses. The third rule is evaluated using public datasets, and the results compare well with C5.0 decision tree classifier. 1 
Towards an Ontology of Approximate Reason.

A rough set approach to knowledge discovery.

Approximate Reasoning by Agents.

Toward Intelligent Systems Calculi of Information Granules.

Analysis of Image Sequences for the Unmanned Aerial Vehicle.

Extracting Patterns Using Information Granules A Brief Introduction.

Rough Measures and Integrals A Brief Introduction.

Sensor%2C Filter%2C and Fusion Models with Rough Petri Nets.

Wireless Agent Guidance of Remote Mobile Robots Rough Integral Approach to Sensor Signal Analysis.

Rough Mereological Calculi of Granules A Rough Set Approach to Computation.

Granular Computing A Rough Set Approach.

Sensor%2C Filter%2C and Fusion Models with Rough Petri Nets.

Information Granule Decomposition.

A rough set approach to reasoning about data.

Information granules Towards foundations of granular computing.

Presenting the special issue on Rough%2Dneuro computing  Preface.

Design of Rough Neurons Rough Set Foundation and Petri Net Model.

Information Granules for Spatial Reasoning.

Synthesis Grammars.
. The state-of-the-art in inductive logic programming is surveyed by analyzing the approach taken by this field over the past 8 years. The analysis investigates the roles of 1) logic programming and machine learning, of 2) theory, techniques and applications, of 3) various technical problems addressed within inductive logic programming. 1 Introduction  The term inductive logic programming was first coined by Stephen Muggleton in 1990 [1]. Inductive logic programming is concerned with the study of inductive machine learning within the representations offered by computational logic. Since 1991, annual international workshops have been organized [2-8]. This paper is an attempt to analyze the developments within this field. Particular attention is devoted to the relation between inductive logic programming and its neighboring fields such as machine learning, computational logic and data mining, and to the role that theory, techniques and implementations, and applications play. The analysis...
Situation Identification by Unmanned Aerial Vehicle.

Rough%2DNeuro Computing.
Summary. Granulation of the universe and approximation of concepts in the granulated universe are two related fundamental issues in the theory of rough sets. Many proposals dealing with the two issues have been made and studied extensively. We present a critical review of results from existing studies that are relevant to a decision-theoretic modeling of rough sets. Two granulation structures are studied, one is a partition induced by an equivalence relation and the other is a covering induced by a reflexive relation. With respect to the two granulated views of the universe, element oriented and granule oriented definitions and interpretations of lower and upper approximation operators are examined. The structures of the families of fixed points of approximation operators are investigated. We start with the notions of rough membership functions and graded set inclusion defined by conditional probability. This enables us to examine different granulation structures and the induced approximations in a decision-theoretic setting. By reviewing and combining results from existing studies, we attempt to establish a solid foundation for rough sets and to provide a systematic way for determining the required parameters in defining approximation operators. 1
Towards Rough Neural Computing Based on Rough Membership Functions Theory and Application.

Approximation of Information Granule Sets.

An Application of Rough Set Methods in Control Design.

Rough Mereology in Information Systems with Applications to Qualitative Spatial Reasoning.

Introduction.
The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating e ects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modi cation of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.  
Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
New Directions in Rough Sets

Grammar Systems for Distributed Synthesis of Approximate Solutions Extracted from Experience.

Decomposition of Task Specification Problems.
. We consider a synthesis of complex objects by multi-agent system based on rough mereological approach. Any agent can produce complex objects from parts obtained from his sub-agents using some composition rules. Agents are equipped with decision tables describing (partial) specifications of their synthesis tasks. We investigate some problems of searching for optimal task specifications for sub-agents having task specification for a super-agent. We propose a decomposition scheme consistent with given composition rules. The computational complexity of decomposition problems is discussed by showing that these problems are equivalent to some well known graph problems. We also propose some heuristics for considered problems. An illustrative example of decomposition and synthesis scheme for object assembling by multi--agent system is included. We show an upper bound of an error rate in synthesis process of our system. A preliminary results related to the presented approach have been reporte...
Boolean Reasoning Scheme with Some Applications in Data Mining.

Towards Discovery of Information Granules.

Information Granules in Distributed Environment.

Rough Sets and Current Trends in Computing
Abstract. This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and posets. The structures of generalized approximation spaces and the properties of approximation operators are analyzed. 1
Rough Mereological Foundatins for Design

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Boolean Reasoning for Feature Extraction Problems.
. We recall several applications of Boolean reasoning for feature extraction and we propose an approach based on Boolean reasoning for new feature extraction from data tables with symbolic (nominal, qualitative) attributes. New features are of the form a 2 V , where V ` Va  and Va is the set of values of attribute a. We emphasize that Boolean reasoning is also a good framework for complexity analysis of the approximate solutions of the discussed problems. 1 Introduction  &#034;Feature Extraction&#034; and &#034;Feature Selection&#034; are important problems in Machine Learning and Data Mining (see e.g. [6, 3, 4]). In previous papers we have considered problems like: short reduct finding problem [16], rule induction problem  [17], optimal discretization problem [12], linear feature (hyperplane) searching problem [13]. Our solutions of these problems are based on Boolean reasoning schema [2]. In this paper we discuss a problem of searching for new features from a data table with symbolic (qualitative) value...
Searching for Relational Patterns in Data.
. We consider several basic classes of tolerance relations among  objects. These (global) relations are defined from some predefined similarity  measures on values of attributes. A tolerance relation in a given  class of tolerance relations is optimal with respect to a given decision  table A if it contains only pairs of objects with the same decision and  the number of such pairs contained in the relation is maximal among all  relations from the class. We present a method for (sub-)optimal tolerance  relation learning from data (decision table). The presented method  is based on rough set approach. We show that for some basic families of  tolerance relations this problem can be transformed to a relative geometrical  problem in a real affine space. Hence geometrical computations are  becoming useful tools for solving the problem of global tolerance relation  construction. The complexity of considered problems can be evaluated by  the complexity of the corresponding geometrical problems...
Rough Sets for Data Mining and Knowledge Discovery %28Abstract%29.

Decision Algorithms A Survey of Rough Set %2D Theoretic Methods.
In this paper we present some strategies for synthesis of decision algorithms  studied by us. These strategies are used by systems of communicating agents and lead  from the original (input) data table to a decision algorithm. The agents are working  with parts of data and they compete for the decision algorithm with the best quality  of object classification.  We give examples of techniques for searching for new features and we discuss some  adaptive strategies based on the rough set approach for the construction of a decision  algorithm from a data table. We also discuss a strategy of clustering by tolerance.  1. 
Rough Set Approximations of Languages.
We investigate here the possibility of approximating a language starting from a partial knowledge of its strings. This is understood as the possibility to read only a bounded part of a string: a prefix or a subword. In this way, indiscernibility relations among strings (they are equivalence or tolerance relations) are introduced, which lead to lower and upper approximations of languages. By varying the length of the perceived substring, we get sequences of approximations converging to the language. In many cases, the approximations of context-free languages are proved to be regular languages. 1. 
Towards a Rough Mereology%2DBased Logic for Approximate Solution Synthesis. Part 1.

Searching for Features Defined by Hyperplanes.

A Rough Set Framework for Data Mining of Propositional Default Rules.
As the amount of information in the world is steadily increasing, there is a growing demand for tools for analysing the information. In this paper we investigate the problem of data mining, that is, constructing decision rules from a set of primitive input data. The main contention of the present work is that there is a need to be able to reason also in presence of inconsistencies, and that more general, possibly unsafe rules should be made available through the data mining process. Such rules are typically simpler in structure, and allow the user to reason in absence of information. A framework is suggested for the generation of propositional default rules that reflect normal intradependencies in the data. 1 Introduction  As the amount of information in the world is steadily increasing, there is a growing demand for tools for analysing the information, finding patterns in terms of implicit dependencies in data. Realising that much of the collected data will not be handled or even seen...
Tolerance Approximation Spaces.

Analytical Morphology Mathematical Morphology of Decision Tables.
We propose a method called analytical morphology for data filtering. The method was  created on the basis of some ideas of rough set theory and mathematical morphology.  Mathematical morphology makes an essential use of geometric structure of objects while  the aim of our method is to provide tools for data filtering when there is no directly  available geometric structure in the data set.  1 Introduction  In many applications there is a need for efficient methods of data filtering even if there is not any preassumed geometrical (affine) structure in the set of attributes (conditions) on the basis of which the decisions should be taken. This situation often occurs when experimental data are recorded in decision tables. The problem arises of providing a framework for data filtering based on tools not relying on affine structure. In our proposition we extract from local relations among data some near-to-functional relations. From these relations we construct the so called approximation f...
Parallel Communicating Grammar Systems with Negotiation.
In a parallel communicating grammar system, several grammars work together, synchronously, on their own sentential forms, and communicate on request. No restriction is imposed usually about the communicated strings. We consider here two types of restrictions, as models of the negotiation process in multi-agent systems: (1) conditions formulated on the transmitted strings, and (2) conditions formulated on the resulting string in the receiving components. These conditions are expressed in terms of regular languages, whose elements the mentioned strings should be. Moreover, we allow that the communicated string is a part (any one, a prefix, a maximal, a minimal one, etc.) of the string of the communicating component. We investigate these variants from the point of view of the generative capacity of the corresponding parallel communicating grammar systems. 1. 
Rough mereology A new paradigm for approximate reasoning.
We are concerned with formal models of reasoning under uncertainty. Many approaches to this problem are known in the literature e.g. Dempster-Shafer theory, bayesian-based reasoning, belief networks, fuzzy logics etc. We propose rough mereology as a foundation for approximate reasoning about complex objects. Our notion of a complex object includes approximate proofs understood as schemes constructed to support our assertions about the world on the basis of our incomplete or uncertain knowledge.  1 Introduction  We present a formal model of approximate reasoning about processes of synthesis of complex systems. First ideas of this approach have been presented in [15], [24], [25], [27], [28], [29], [30], [31]. Our research has been stimulated by the demand for solutions of the following groups of problems, estimated in [1] to be crucial for the progress in the area of automated design and manufacturing. These groups of problems are concerned with the treatment of:  Group 1. Poorly defined...
A Parallel Algorithm for Real%2DTime Decision Making A Rough Set Approach.
We consider decision tables with the values of conditional attributes (conditions) measured by sensors. These sensors produce outputs after an unknown but finite number of time units. We construct an algorithm for computing a highly parallel program represented by a Petri net from a given decision table. The constructed net allows to identify objects in decision tables to an extent which makes appropriate decisions possible. The outputs from sensors are propagated through the net with maximal speed. This is done by an appropriate implementation of all rules true in a given decision table. Our approach is based on rough set theory [20]. It also seems to have some significance for theoretical foundations of real-time systems.  Keywords: real-time systems, information systems, rough sets, decision rules, Petri nets 1 Introduction  We assume that a decision table S representing experimental knowledge is given [20]. It consists of a number of rows labeled by elements from a set of objects  ...
Discovery of Concurrent Data Models from Experimental Tables A Rough Set Approach.
. The main objective of machine discovery is the determination of relations between data and of data models. In the paper we describe a method for discovery of data models represented by concurrent systems from experimental tables. The basic step consists in a determination of rules which yield a decomposition of experimental data tables; the components are then used to define fragments of the global system corresponding to a table. The method has been applied to automatic data models discovery from experimental tables with Petri nets as models for concurrency. Keywords: data mining, system decomposition, rough sets, concurrent models, laws discovery from experimental data 1. Introduction  Machine discovery has elaborated methods for the discovery of relations among observed data (cf. [42]) and of data models. Recent research shows that these methods can be applied among others in knowledge discovery in databases [20], scientific discovery [22], concept discovery [14], automated data a...
Synthesis of Adaptive Decision Systems from Experimental Data.

Application of Modal Logics and Rough Sets for Classifying Objects.

Rough Mereology and Analytical Morphology New Development in Rough Set Theory.

Extracting Laws from Decision Tables A Rough Set Approach.

In Memoriam Helena Rasiowa.

Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables.
. We apply rough set methods and boolean reasoning for knowledge discovery from decision tables. It is not always possible to extract general laws from experimental data by computing first all reducts [12] of a decision table and next decision rules on the basis of these reducts. We investigate a problem how information about the reduct set changes in a random sampling process of a given decision table could be used to generate these laws. The reducts stable in the process of decision table sampling are called dynamic reducts. Dynamic reducts define the set of attributes called the dynamic core. This is the set of attributes included in all dynamic reducts. The set of decision rules can be computed from the dynamic core or from the best dynamic reducts. We report the results of experiments with different data sets, e.g. market data, medical data, textures and handwritten digits. The results are showing that dynamic reducts can help to extract laws from decision tables. Key words: evol...
Rough Mereology.
. We show how to organize a collection of intelligent cooperating agents into a rough mereological controller for the purpose of assembling a complex object with desired quality from its elementary parts. This scheme for synthesis of a complex object from its elementary parts provides a framework for e.g. quality control in concurrent engineering as well as cooperative problem-solving. 1 Introduction  There are various approaches to the problem of measuring the degree to which elements belong to a given set. Among them are fuzzy set theory [10] and rough set theory [3]. We propose to take as a primitive notion a function (called a rough inclusion)  returning the degree of inclusion of one set into another. We assume [5] some natural conditions motivated by properties of rough membership functions [4] which characterize rough inclusions. Any rough inclusion can be regarded as the family of partial inclusion relations (indexed by degree of inclusion being the value of the rough inclusion...
Boolean Reasoning for Decision Rules Generation.

Data Filtration A Rough Set Approach.

Approximation of Relations.
We generalize the notion of an approximation space introduced in [3]. In generalized approximation spaces we define the lower and upper set approximations. We illustrate the introduced notions with different types of relation approximation. 1 Introduction  Investigations on relation approximation are well motivated both from theoretical and practical points of view. The equality approximation is fundamental for a generalization of the rough set approach [3] to the case of an indiscernibility relation being based on an approximation of the equality relations in the value sets of attributes rather than on the exact equality relations in these sets. Applications of rough set methods in process control require some good tools for function approximation. Finally, let us also mention some applications of relation approximation to discrete optimization problems [7] where approximations of input-output relations of programs are investigated. The relation approximation based on the rough set ap...
Management of Uncertainty in AI A Rough Set Approach.

A rough set approach to real%2Dtime state identification.

Towards an approximation theory of discrete problems%2C Part I.

The evidence theory and decision tables.

The Power of the Lambda Abstraction Strategy for Program Derivation.

Attributes and rough properties in information systems.

Higher Order Generalization in Program Derivation.

Factual Knowledge For Developing Concurrent Programs.

Using Facts for Improving the Parallel Execution of Functional Programs.

Approximation logic.
A practical procedure for computing a regular approximation of a logic program is given. The algorithm shown here incorporates optimisations taken from deductive database fixpoint algorithms and efficient abstract interpretation techniques. Regular approximations can be applied to a variety of tasks in debugging and program specialisation. Frameworks for defining regular approximations have been put forward in the past, but previously no practical tools that can be effectively applied to large programs have been produced, to our knowledge. Precision of the approximation can be improved by applying query-answer transformations to a program and a goal and this gives much more precise results than reported elsewhere. The trade-off of precision versus complexity is discussed and illustrated. We give performance results for our procedure on a range of programs. 1 Introduction Given a definite logic program P , the problem we address is how to compute a regular approximation of P . An appro...
Communicating agents for applicative concurrent programming.

Concurrent programs.
Much has been learned in the last decade about concurrent programming..This patmr identifies the major concepts of concurrent programming and describes some of the more importam language notations for writing concurrent programs. The roles of processes, communication, and synchronization are discussed. Language notations for expressing
A Mathematical Model of Parallel Information Processing.

Simulation.
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
Machines with Input and Output.
This article shines some light in the &#034;four dark corners,&#034; exposing problems and proposing solutions. We show that all descriptions involved in requirements engineering should be descriptions of the environment. We show that certain control information is necessary for sound requirements engineering, and we explain the close association between domain knowledge and refinement of requirements. Together these conclusions explain the precise nature of requirements, specifications, and domain knowledge, as well as the precise nature of the relationships among them. They establish minimum standards for what information should be represented in a requirements language. They also make it possible to determine exactly what it means for requirements engineering to be successfully completed.
Stored Program Machines.

Basic Operations on Semantic Translations.

